Non-stretchable pseudo-visibility graphs
نویسنده
چکیده
We exhibit a family of graphs which can be realized as pseudo-visibility graphs of pseudo-polygons, but not of straight-line polygons. The example is based on the characterization of vertex-edge pseudo-visibility graphs of O’Rourke and Streinu [Proc. ACM Symp. Comput. Geometry, Nice, France, 1997, pp. 119–128] and extends a recent result of the author [Proc. ACM Symp. Comput. Geometry, Miami Beach, 1999, pp. 274–280] on nonstretchable vertex-edge visibility graphs. We construct a pseudo-visibility graph for which there exists a unique compatible vertex-edge visibility graph, which is then shown to be non-stretchable. The construction is then extended to an infinite family. 2004 Elsevier B.V. All rights reserved.
منابع مشابه
A Characterization of Visibility Graphs for Pseudo-polygons
In this paper, we give a characterization of the visibility graphs of pseudo-polygons. We first identify some key combinatorial properties of pseudo-polygons, and we then give a set of five necessary conditions based off our identified properties. We then prove that these necessary conditions are also sufficient via a reduction to a characterization of vertex-edge visibility graphs given by O’R...
متن کاملMHD Flow and Heat Transfer Analysis of Micropolar Fluid through a Porous Medium between Two Stretchable Disks Using Quasi-Linearization Method
In this paper, a comprehensive numerical study is presented for studying the MHD flow and heat transfer characteristics of non-Newtonian micropolar fluid through a porous medium between two stretchable porous disks. The system of governing equations is converted into coupled nonlinear ordinary ones through a similarity transformation, which is then solved using Quasi-linearization ...
متن کاملCombinatorial pseudo-triangulations
We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of [4] which treats the minimally generically rigid case. The proof uses the concept of combinatorial pseudo-triangulation, CPT, in the plane and has two main steps: showing that a certain " generalized Laman property " is a necessary and s...
متن کاملM ar 2 00 5 COMBINATORIAL PSEUDO - TRIANGULATIONS
We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of [4] which treats the minimally generically rigid case. The proof uses the concept of combinatorial pseudo-triangulation, CPT, in the plane and has two main steps: showing that a certain " generalized Laman property " is a necessary and s...
متن کامل. C O ] 2 9 Ju l 2 00 3 COMBINATORIAL PSEUDO - TRIANGULATIONS
We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of [4] which treats the minimally generically rigid case. The proof uses the concept of combinatorial pseudo-triangulation, CPT, in the plane and has two main steps: showing that a certain " generalized Laman property " is a necessary and s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 31 شماره
صفحات -
تاریخ انتشار 1999